Optimal capacity allocation for heavy-traffic fixed-cycle traffic-light queues and intersections
نویسندگان
چکیده
Setting traffic light signals is a classical topic in engineering, and important heavy-traffic conditions when green times become scarce longer queues are inevitably formed. For the fixed-cycle traffic-light queue, an elementary queueing model for one with cyclic signaling, we obtain limits that capture long-term queue behavior. We leverage limit theorems to sharp performance approximations heavy traffic. also consider optimization problems aim optimal division of among multiple conflicting streams. show inserting leads tractable close-to-optimal signal prescriptions.
منابع مشابه
Gaussian queues in light and heavy traffic
In this paper we investigate Gaussian queues in the light-traffic and in the heavy-traffic regime. Let Q X ≡ {Q X (t) : t ≥ 0} denote a stationary buffer content process for a fluid queue fed by the centered Gaussian process X ≡ {X(t) : t ∈ R} with stationary increments, X(0) = 0, continuous sample paths and variance function σ 2(·). The system is drained at a constant rate c > 0, so that for a...
متن کاملBounds and Approximations for the Fixed-Cycle Traffic-Light Queue
This paper deals with the fixed-cycle traffic-light (FCTL) queue, where vehicles arrive to an intersection controlled by a traffic light and form a queue. The traffic light alternates between green and red periods, and delayed vehicles are assumed to depart during the green period at equal time intervals. The key performance characteristic in the FCTL queue is the so-called mean overflow, defin...
متن کاملGaussian queues in the heavy/light-traffic regime
In this paper we investigate Gaussian queues in the light-traffic and in the heavy-traffic regime. The setting considered is that of a centered Gaussian process X ≡ {X(t) : t ∈ R} with stationary increments and variance function σ X(·), equipped with a deterministic drift c > 0, reflected at 0: Q (c) X (t) = sup −∞<s≤t (X(t)−X(s)− c(t− s)). We study the resulting stationary workload processQ (c...
متن کاملHeavy-traffic extreme-value limits for queues
We consider the maximum waiting time among the first n customers in the GI/G/1 queue. We use strong approximations to prove, under regularity conditions, convergence of the normalized maximum wait to the Gumbel extreme-value distribution when the traffic intensity p approaches 1 from below and n approaches infinity at a suitable rate. The normalization depends on the interarrival-time and servi...
متن کاملHeavy and Light Traffic
Title of Dissertation: HEAVY AND LIGHT TRAFFIC REGIMES FOR M |G|∞ TRAFFIC MODELS Konstantinos P. Tsoukatos, Doctor of Philosophy, 1999 Dissertation directed by: Professor Armand M. Makowski Department of Electrical Engineering The M |G|∞ busy server process provides a class of structural models for communication network traffic. In this dissertation, we study the asymptotic behavior of a networ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Part B-methodological
سال: 2023
ISSN: ['1879-2367', '0191-2615']
DOI: https://doi.org/10.1016/j.trb.2022.11.010